New variations of the reverse facility location problem
نویسندگان
چکیده
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m facilities, where a user takes service from its nearest facility, the objective is to place two new facilities such that the total number of users served by these two new facilities is maximized. We refer to this problem as the 2-MaxCov problem. In the L1 and L∞ metrics, the worst case time and space complexities of our proposed algorithm for solving this problem are both O(n log n). In the L2 metric, we propose an algorithm for solving the problem in O(n log n) time, if m = 1. We have also considered the obnoxious version of this problem, referred to as the 2-Farthest-MaxCov problem, where a user is served by its farthest facility. Our proposed algorithm for this problem runs in O(n log n) time for all the considered distance measures.
منابع مشابه
Inverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملA New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملA Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملA hybrid DEA-based K-means and invasive weed optimization for facility location problem
In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...
متن کاملIntegrated technique for the optimization of healthcare facility problem
Access to basic health care services is one of the major issues in developing nations. The location of health care facilities is an important aspect in health care delivery. It is therefore necessary for health care services to be located optimally to serve the demands well. This study develops an integrated methodology in the field of healthcare location which minimizes the weighted average Eu...
متن کامل